Size-Change Termination, Monotonicity Constraints and Ranking Functions
نویسنده
چکیده
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by monotonicity constraints over (abstract) variables. Size-change graphs are a subclass where only constraints of the form x > y and x ≥ y are allowed. Both theory and practice are now more evolved in this restricted framework than in the general framework of monotonicity constraints. This paper shows that it is possible to adapt and extend some theory from the domain of size-change graphs to the general case, thus complementing previous work on monotonicity constraints. In particular, we present precise decision procedures for termination; and we provide a procedure to construct explicit global ranking functions from monotonicity constraints in singly-exponential time, which is better than what has been published so far even for size-change graphs.
منابع مشابه
Testing for Termination with Monotonicity Constraints
Termination analysis is often performed over the abstract domains of monotonicity constraints or of size change graphs. First, the transition relation for a given program is approximated by a set of descriptions. Then, this set is closed under a composition operation. Finally, termination is determined if all of the idempotent loop descriptions in this closure have (possibly different) ranking ...
متن کاملMonotonicity Constraints for Termination in the Integer Domain
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we use a program abstraction in which transitions are described by monotonicity constraints over (abstract) variables. When only constraints of the form x > y and x ≥ y are allowed, we have size-change graphs. In the last decade, both theory and practice have evol...
متن کاملSAT-based termination analysis using monotonicity constraints over the integers
We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a nontrivial extension of the well-known size-change termination method. While deciding termination for systems of monotonicity constraints is PSPACE complete, we focus on a well-defined and significant subset, which we call MCNP (for...
متن کاملSize-Change Termination Analysis in k-Bits
Size-change termination analysis is a simple and powerful technique successfully applied for a variety of programming paradigms. A main advantage is that termination for size-change graphs is decidable and based on simple linear ranking functions. A main disadvantage is that the size-change termination problem is PSPACE-complete. Proving size change termination may have to consider exponentiall...
متن کاملA SAT-Based Approach to Size Change Termination with Global Ranking Functions
We describe a new approach to proving termination with size change graphs. This is the first decision procedure for size change termination (SCT) which makes direct use of global ranking functions. It handles a well-defined and significant subset of SCT instances, designed to be amenable to a SAT-based solution. We have implemented the approach using a state-of-the-art Boolean satisfaction solv...
متن کامل